264 research outputs found

    Analysis and Verification of Service Interaction Protocols - A Brief Survey

    Get PDF
    Modeling and analysis of interactions among services is a crucial issue in Service-Oriented Computing. Composing Web services is a complicated task which requires techniques and tools to verify that the new system will behave correctly. In this paper, we first overview some formal models proposed in the literature to describe services. Second, we give a brief survey of verification techniques that can be used to analyse services and their interaction. Last, we focus on the realizability and conformance of choreographies.Comment: In Proceedings TAV-WEB 2010, arXiv:1009.330

    Formalizing Adaptation On-the-Fly

    Get PDF
    AbstractParadigm models specify coordination of collaborating components via constraint control. Component McPal allows for later addition of new constraints and new control in view of unforeseen adaptation. After addition McPal starts coordinating migration accordingly, adapting the system towards to-be collaboration. Once done, McPal removes obsolete control and constraints. All coordination remains ongoing while migrating on-the-fly, being deflected without any quiescence. Through translation into process algebra, supporting formal analysis is arranged carefully, showing that as-is and to-be processes are proper abstractions of the migrating process. A canonical critical section problem illustrates the approach

    On Negotiation as Concurrency Primitive

    Full text link
    We introduce negotiations, a model of concurrency close to Petri nets, with multiparty negotiation as primitive. We study the problems of soundness of negotiations and of, given a negotiation with possibly many steps, computing a summary, i.e., an equivalent one-step negotiation. We provide a complete set of reduction rules for sound, acyclic, weakly deterministic negotiations and show that, for deterministic negotiations, the rules compute the summary in polynomial time

    Tau Be or not Tau Be? - A Perspective on Service Compatibility and Substitutability

    Get PDF
    One of the main open research issues in Service Oriented Computing is to propose automated techniques to analyse service interfaces. A first problem, called compatibility, aims at determining whether a set of services (two in this paper) can be composed together and interact with each other as expected. Another related problem is to check the substitutability of one service with another. These problems are especially difficult when behavioural descriptions (i.e., message calls and their ordering) are taken into account in service interfaces. Interfaces should capture as faithfully as possible the service behaviour to make their automated analysis possible while not exhibiting implementation details. In this position paper, we choose Labelled Transition Systems to specify the behavioural part of service interfaces. In particular, we show that internal behaviours (tau transitions) are necessary in these transition systems in order to detect subtle errors that may occur when composing a set of services together. We also show that tau transitions should be handled differently in the compatibility and substitutability problem: the former problem requires to check if the compatibility is preserved every time a tau transition is traversed in one interface, whereas the latter requires a precise analysis of tau branchings in order to make the substitution preserve the properties (e.g., a compatibility notion) which were ensured before replacement.Comment: In Proceedings WCSI 2010, arXiv:1010.233

    IN VIVO CONFOCAL MICROENDOSCOPY: FROM THE PROXIMAL BRONCHUS DOWN TO THE PULMONARY ACINUS

    Get PDF
    In vivo endoscopic microscopy aims to provide the clinician with a tool to assess architecture and morphology of a living tissue in real time, with an optical resolution similar to standard histopathology. To date, available microendoscopic devices use the principle of fluorescence confocal microscopy, and thereby mainly analyse the spatial distribution of specific endogenous or exogenous fluorophores. Fluorescence microendoscopes devoted to respiratory system exploration use a bundle of optical fibres, introduced into the working channel of the bron- choscope. This miniprobe can be applied in vivo onto the bronchial inner surface or advanced into a distal bron- chiole down to the acinus, to produce in situ, in vivo microscopic imaging of the respiratory tract in real time. Fluorescence confocal microendoscopy has the capability to image the epithelial and subepithelial layers of the pro- ximal bronchial tree, as well as the more distal parts of the lungs, from the terminal bronchioles down to the alveolar ducts and sacs. Potential applications include in vivo microscopic assessment of early bronchial cancers, bronchial wall remodelling evaluation and diffuse peripheral lung disease exploration, as well as in vivo diagnosis of peripheral lung nodules. The technique has also the potential to be coupled with fluorescence molecular imaging. This chapter de- scribes the capabilities and possible limitations of confocal microendoscopy for proximal and distal lung exploration

    Ab initio investigation of lattice dynamics of fluoride scheelite LiYF4

    Full text link
    We report on the phonon dynamics of LiYF4 obtained by direct method using first principle calculations. The agreement between experimental and calculated modes is satisfactory. An inversion between two Raman active modes is noticed compared to inelastic neutron scattering and Raman measurements. The atomic displacements corresponding to these modes are discussed. Multiple inversions between Raman and infrared active groups are present above 360 cm-1. The total and partial phonon density of state is also calculated and analyzed

    Explicit connection actions in multiparty session types

    Get PDF
    This work extends asynchronous multiparty session types (MPST) with explicit connection actions to support protocols with op- tional and dynamic participants. The actions by which endpoints are connected and disconnected are a key element of real-world protocols that is not treated in existing MPST works. In addition, the use cases motivating explicit connections often require a more relaxed form of mul- tiparty choice: these extensions do not satisfy the conservative restric- tions used to ensure safety in standard syntactic MPST. Instead, we de- velop a modelling-based approach to validate MPST safety and progress for these enriched protocols. We present a toolchain implementation, for distributed programming based on our extended MPST in Java, and a core formalism, demonstrating the soundness of our approach. We discuss key implementation issues related to the proposed extensions: a practi- cal treatment of choice subtyping for MPST progress, and multiparty correlation of dynamic binary connections

    DFT study of pressure induced phase transitions in LiYF4

    Full text link
    An investigation of the pressure induced phase transition from the scheelite phase (I41/a, Z=4) to the fergusonite-like phase (I2/a, Z=4)/LaTaO(P21/c, Z=4) of LiYF4 is presented. Employing density functional theory (DFT) within the generalized gradient approximation, the internal degrees of freedom were relaxed for a pressure range of 0 GPa to 20 Gpa. The influence of pressure on the lattice vibration spectrum of the scheelite phase (I41/a, Z=4) was evaluated using the direct approach, i.e. using force constants calculated from atomic displacements. The transition volume is in good agreement with experiment, while the transition pressure is overestimated of 6 GPa. At 20 GPa, a P21/c structure with apentacoordinated lithium cation is found to be the most stable phase. This structure is compatible with a transition driven by a Bg zone-center soft optic mode linked to a soft-acoustic mode along the [11-1] direction as observed for the proper ferroelastic transition of BiVO4

    Plant extract enhances the viability of Lactobacillus delbrueckii subsp. bulgaricus and Lactobacillus acidophilus in probiotic nonfat yogurt

    Get PDF
    Citation: Michael, M., Phebus, R. K., & Schmidt, K. A. (2015). Plant extract enhances the viability of Lactobacillus delbrueckii subsp. bulgaricus and Lactobacillus acidophilus in probiotic nonfat yogurt. Food Science & Nutrition, 3(1), 48-55. doi:10.1002/fsn3.189A commercial plant extract (prepared from olive, garlic, onion and citrus extracts with sodium acetate (SA) as a carrier) was evaluated to extend the viability of yogurt starter and probiotic bacteria as a means to enhance the shelf life of live and active culture, probiotic nonfat yogurt. Yogurts prepared from three different formulas (0.5% plant extract, 0.25% SA, or no supplement) and cultures (yogurt starter plus Bifidobacterium animalis, Lactobacillus acidophilus, or both probiotics) were assessed weekly during 29 days of storage at 5 degrees C. Supplemented yogurt mixes had greater buffering capacities than non-supplemented yogurt mixes. At the end of storage, Lactobacillus bulgaricus and L. acidophilus counts in supplemented yogurts were greater compared with non-supplemented yogurts. Supplementation did not affect Streptococcus thermophilus and B. animalis counts. Hence the greater buffering capacity of yogurt containing plant extract could enhance the longevity of the probiotics, L. bulgaricus and L. acidophilus, during storage

    Non-Local Configuration of Component Interfaces by Constraint Satisfaction

    Get PDF
    © 2020 Springer-Verlag. The final publication is available at Springer via https://doi.org/10.1007/s10601-020-09309-y.Service-oriented computing is the paradigm that utilises services as fundamental elements for developing applications. Service composition, where data consistency becomes especially important, is still a key challenge for service-oriented computing. We maintain that there is one aspect of Web service communication on the data conformance side that has so far escaped the researchers attention. Aggregation of networked services gives rise to long pipelines, or quasi-pipeline structures, where there is a profitable form of inheritance called flow inheritance. In its presence, interface reconciliation ceases to be a local procedure, and hence it requires distributed constraint satisfaction of a special kind. We propose a constraint language for this, and present a solver which implements it. In addition, our approach provides a binding between the language and C++, whereby the assignment to the variables found by the solver is automatically translated into a transformation of C++ code. This makes the C++ Web service context compliant without any further communication. Besides, it uniquely permits a very high degree of flexibility of a C++ coded Web service without making public any part of its source code.Peer reviewe
    corecore